The complexity of finding temporal separators under waiting time constraints

In this work, we investigate the computational complexity of Restless Temporal (s,z)-Separation, where are asked whether it is possible to destroy all restless temporal paths between two distinct vertices s and z by deleting at most k from a graph. A graph has fixed vertex set but edges have (discrete) time stamps. path uses with non-decreasing stamps spent each must not exceed given duration Δ. (s,z)-Separation naturally generalizes NP-hard problem. We show that complete for Σ2P, class located in second level polynomial hierarchy. further provide some insights parameterized separator size k.